Dominating set - PDFSEARCH.IO - Document Search Engine

Dominating set
Results: 145

#	Item
71	0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Add to Reading List Source URL: mrfellows.net Language: English - Date: 2009-09-08 08:50:37 NP-complete problems Analysis of algorithms Parameterized complexity Graph coloring Kernelization Dominating set Feedback vertex set Vertex cover Tree decomposition Theoretical computer science Graph theory Computational complexity theory
72	Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:04 Applied mathematics NP-complete problems Dominating set Random graph Connectivity Graph Theoretical computer science Mathematics Graph theory
73	CCCG 2011, Toronto ON, August 10–12, 2011 Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks Minati De∗† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Mathematics Dominating set Unit disk graph Independent set APX Approximation algorithm Vertex cover Planar separator theorem Theoretical computer science Graph theory NP-complete problems
74	Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT Michael R. Fellows School of Electrical Engineering and Computer Science University of Newcastle, University Drive, Callaghan NSW 2308, Australia mfellow Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-05 20:16:31 NP-complete problems Parameterized complexity Kernelization Dominating set Vertex cover Path decomposition Planar separator theorem Clique problem Graph coloring Theoretical computer science Graph theory Mathematics
75	Iterative Compression and Exact Algorithms Fedor V. Fomin∗ Serge Gaspers† Mathieu Liedloff§ Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2009-10-29 15:21:24 NP-complete problems Vertex cover Feedback vertex set Independent set Matching Maximal independent set Parameterized complexity Algorithm Dominating set Theoretical computer science Mathematics Computational complexity theory
76	CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:18 NP-complete problems Graph coloring Domatic number Dominating set Independent set Greedy coloring Topology Maximal independent set Graph Graph theory Theoretical computer science Mathematics
77	CCCG 2011, Toronto ON, August 10–12, 2011 Euclidean Movement Minimization Nima Anari∗ MohammadAmin Fazli† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2011-08-06 04:11:16 NP-complete problems Hamiltonian path Vertex cover Independent set Matching Minimum spanning tree Dominating set Graph coloring Theoretical computer science Graph theory Mathematics
78	Welcome Frances Rosamond, Editor Welcome to the Parameterized Complexity Newsletter. We are delighted to announce the IPEC 2010 winners of the Excellent Student Paper Awards. The meeting was expertly organized in Chennai Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2012-09-17 05:22:16 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Complexity classes Tree decomposition Dominating set International Colloquium on Automata Languages and Programming Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
79	A Fast Algorithm for Point Labeling Problem Sasanka Roy∗ Subhasis Bhattacharjee∗ Subhas C. Nandy Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-08-05 21:28:00 NP-complete problems Combinatorial optimization 2-satisfiability Independent set Matching Automatic label placement Algorithm Dominating set Partial cube Theoretical computer science Mathematics Graph theory
80	PDF Document Add to Reading List Source URL: fpt.wdfiles.com Language: English - Date: 2013-01-31 16:33:06 NP-complete problems Analysis of algorithms Parameterized complexity Dominating set Kernelization Vertex cover Path decomposition Tree decomposition Time complexity Theoretical computer science Computational complexity theory Graph theory

UPDATE